Imagining the Nation: Independence Ceremonies under Rebel Domination in Northern Côte d'Ivoire
نویسندگان
چکیده
منابع مشابه
Independence - domination duality
Given a system G = (G1,G2, . . . ,Gm) of m graphs on the same vertex set V , define the “joint independence number” α∩(G) as the maximal size of a set which is independent in all graphs Gi . Let also γ∪(G) be the “collective domination number” of the system, which is the minimal number of neighborhoods, each taken from any of the graphs Gi , whose union is V . König’s classical duality theorem ...
متن کاملHereditary Domination & Independence Parameters
For a graphical property P and a graph G, we say that a subset S of the vertices of G is a P-set if the subgraph induced by S has the property P. Then the P-domination number of G is the minimum cardinality of a dominating P-set and the P-independence number the maximum cardinality of a P-set. We show that several properties of domination, independent domination and acyclic domination hold for ...
متن کاملOn Independence Domination
Let G be a graph. The independence-domination number γ(G) is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of γ(G) for graphs in several graph classes related to cographs. We present an exact exponential algorithm. We also present a PTAS for planar graphs.
متن کاملInequalities Involving Independence Domination , / - Domination , Connected and Total / - Domination Numbers
Let / be an integer-valued function defined on the vertex set V(G) of a graph G. A subset D of V(G) is an /-dominating set if each vertex x outside D is adjacent to at least f(x) vertices in D. The minimum number of vertices in an /-dominating set is denned to be the /-domination number, denoted by 7/(G). In a similar way one can define the connected and total /-domination numbers 7 C| /(G) and...
متن کاملMixed Roman domination and 2-independence in trees
Let $G=(V, E)$ be a simple graph with vertex set $V$ and edge set $E$. A {em mixed Roman dominating function} (MRDF) of $G$ is a function $f:Vcup Erightarrow {0,1,2}$ satisfying the condition that every element $xin Vcup E$ for which $f(x)=0$ is adjacentor incident to at least one element $yin Vcup E$ for which $f(y)=2$. The weight of anMRDF $f$ is $sum _{xin Vcup E} f(x)$. The mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: African Arts
سال: 2012
ISSN: 0001-9933,1937-2108
DOI: 10.1162/afar_a_00010